-
1 truth-table reducible set
Математика: таблично сводимое множествоУниверсальный англо-русский словарь > truth-table reducible set
-
2 truth-table reducible set
English-Russian scientific dictionary > truth-table reducible set
-
3 set
1) набор; комплект- semiconductor assembly set - set of Belleville springs - set of conventional set - set of drawing instruments - set of gate patterns - set of gauge blocks - set of logical elements - set of statistical data - set of technical aids- snap set2) партия3) совокупность; множество4) установка; агрегат- desk telephone set - dial telephone set- gear set- local-battery telephone set - man-pack radio set - multi-operator welding set - sound-powered telephone set - wall telephone set5) регулировка; настройка || регулировать; настраивать6) группа; ансамбль7) класс; семейство9) схватывание || схватываться10) затвердевание || затвердевать11) крепление || закреплять12) геол. свита пород13) осадка (грунта) || оседать ( о грунте)14) радиоточка15) спорт сет16) включать, приводить в действие17) мат. множествоset closed under operation — множество, замкнутое относительно операции
- absolutely compact set - absolutely continuous set - absolutely convex set - absolutely irreducible set - absolutely measurable set - affinely independent set - affinely invariant set - algebraically independent set - almost finite set - almost full set - angular cluster set - asymptotically indecomposable set - at most denumerable set - centro-symmetric set - completely bounded set - completely continuous set - completely generating set - completely improper set - completely irreducible set - completely nonatomic set - completely normal set - completely ordered set - completely productive set - completely reducible set - completely separable set - constructively nonrecursive set - convexly independent set - countably infinite setto set aside — не учитывать, не принимать во внимание; откладывать
- cut set- cyclically ordered set - deductively inconsistent set - derived set - doubly well-ordered set - dual set of equations - dynamically disconnected set - effectively enumerable set - effectively generating set - effectively nonrecursive set - effectively simple set - enumeration reducible set - finely perfect set - finitely definite set - finitely measurable set- flat set- full set- fully reducible set - functionally closed set - functionally complete set - functionally open set - fundamental probability set - generalized almost periodic set- goal set- internally stable set- knot set- left directed set - left normal set - left-hand cluster set - linearly ordered set - local peak set - locally arcwise set - locally closed set - locally compact set - locally connected set - locally contractible set - locally convex set - locally finite set - locally invariant set - locally negligible set - locally null set - locally polar set - locally polyhedral set - metrically bounded set - metrically dense set - multiply ordered set - nearly analytic set - nearly closed set - nonvoid set - normally ordered set- null set- open in rays set - partitioned data set- peak set- pole set- positively homothetic set- pure set- radially open set - rationally independent set - recursively creative set - recursively indecomposable set - recursively isomorphic set - recursively productive set - regularly convex set - regularly situated sets - relatively closed set - relatively compact set - relatively dense set - relatively interpretable set - relatively open set - right normal set - right-hand cluster set- scar set- sequentially complete set - serially ordered set - set of elementary events - set of first category - set of first kind - set of first species - set of possible outcomes - set of probability null - set of second category - set of second species - shift invariant set - simply connected set - simply ordered set - simply transitive set- skew set- star set- strongly bounded set - strongly closed set - strongly compact set - strongly connected set - strongly convex set - strongly dependent set - strongly disjoint sets - strongly enumerable set - strongly independent set - strongly minimal set - strongly polar set - strongly reducible set - strongly separated set - strongly simple set - strongly stratified set- tame set- tautologically complete set - tautologically consistent set - tautologically inconsistent set- test set- thin set- tie set- time set- totally disconnected set - totally imperfect set - totally ordered set - totally primitive set - totally unimodular set - totally unordered set - truth-table reducible set - uniformly bounded set - uniformly continuous set - uniformly convergent set - uniformly integrable set - uniformly universal set - unilaterally connected set- unit set- vacuous set- void set- weakly compact set - weakly convex set - weakly n-dimensional set - weakly stratified set - weakly wandering set - well chained set - well founded set - well measurable set - well ordering set - well quasiordered set -
4 таблично сводимое множество
Русско-английский научно-технический словарь Масловского > таблично сводимое множество
-
5 таблично сводимое множество
Mathematics: truth-table reducible setУниверсальный русско-английский словарь > таблично сводимое множество
См. также в других словарях:
Truth table reduction — In computability theory, a truth table reduction is a reduction from one set of natural numbers to another. Truth table reductions are less powerful than Turing reductions, since not every Turing reduction between sets can be performed by a truth … Wikipedia
Leibniz: truth, knowledge and metaphysics — Nicholas Jolley Leibniz is in important respects the exception among the great philosophers of the seventeenth century. The major thinkers of the period characteristically proclaim the need to reject the philosophical tradition; in their… … History of philosophy
Reduction (recursion theory) — In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated by the question: given sets A and B of natural numbers, is it possible to effectively… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Turing reduction — In computability theory, a Turing reduction from a problem A to a problem B, named after Alan Turing, is a reduction which solves A, assuming B is already known (Rogers 1967, Soare 1987). It can be understood as an algorithm that could be used to … Wikipedia
Tautology (logic) — In propositional logic, a tautology (from the Greek word ταυτολογία) is a propositional formula that is true under any possible valuation (also called a truth assignment or an interpretation) of its propositional variables. For example, the… … Wikipedia
Reduction (complexity) — Example of a reduction from a boolean satisfiability problem to a vertex cover problem. Blue vertices form a vertex cover which corresponds to truth values. In computability theory and computational complexity theory, a reduction is a… … Wikipedia
History of logic — Philosophy ( … Wikipedia
literature — /lit euhr euh cheuhr, choor , li treuh /, n. 1. writings in which expression and form, in connection with ideas of permanent and universal interest, are characteristic or essential features, as poetry, novels, history, biography, and essays. 2.… … Universalium
mathematics — /math euh mat iks/, n. 1. (used with a sing. v.) the systematic treatment of magnitude, relationships between figures and forms, and relations between quantities expressed symbolically. 2. (used with a sing. or pl. v.) mathematical procedures,… … Universalium
